skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Creators/Authors contains: "Zhang, Cun-Quan"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; ; (, Discrete Mathematics)
    Full Text Available 
  2. ; ; (, Journal of Combinatorial Theory, Series B)
    null (Ed.)
    Full Text Available 
  3. ; ; ; ; ; (, Journal of Combinatorial Theory, Series B)
    null (Ed.)
    Full Text Available 
  4. ; ; (, European Journal of Combinatorics)
    Full Text Available 
  5. ; ; ; ; (, SIAM Journal on Discrete Mathematics)
    null (Ed.)
    Full Text Available 
  6. ; ; (, Asia-Pacific Journal of Operational Research)
    Let [Formula: see text] be a directed graph associated with a weight [Formula: see text]. For an edge-cut [Formula: see text] of [Formula: see text], the average weight of [Formula: see text] is denoted and defined as [Formula: see text]. An optimal edge-cut with average weight is an edge-cut [Formula: see text] such that [Formula: see text] is maximum among all edge-cuts (or minimum, symmetrically). In this paper, a polynomial algorithm for this problem is proposed for finding an optimal edge-cut in a rooted tree separating the root and the set of all leafs. This algorithm enables us to develop an automatic clustering method with more accurate detection of community output. 
    more » « less
    Full Text Available 
  7. ; ; ; (, Journal of Combinatorial Theory, Series B)
    Full Text Available 
  8. ; ; ; (, Discrete Mathematics)
    Full Text Available 
  9. ; ; ; (, Journal of Combinatorial Theory, Series B)
    Full Text Available 
  10. ; ; ; ; (, Journal of Graph Theory)
    Full Text Available